Towards Combinatory Logic Synthesis
نویسنده
چکیده
A theory of composition synthesis based on inhabitation in combinatory logic is described and illustrated with examples. Composition synthesis automatically generates applicative combinations of typed combinators inhabiting a goal type. In the intended applications, combinatory type environments model repositories of components, and types are used to specify their interfaces enriched with semantic and behavioural information. The inhabitation relation in combinatory logic is seen to define an abstract logic programming language, by regarding type environments as logic programs whose operational semantics are given by a search procedure for inhabitants. Intersection types are used to specify the intended semantics and behaviour of combinators. The idea of composition synthesis based on combinatory logic has been implemented in a system, CLS (Combinatory Logic Synthesizer).
منابع مشابه
Automatic synthesis of component & connector software architectures with bounded combinatory logic
Combinatory logic synthesis is a new type-based approach towards automatic synthesis of software from components in a repository. In this thesis we show how the type-based approach can naturally be used to exploit taxonomic conceptual structures in software architectures and component repositories to enable automatic composition and configuration of components, and also code generation, by asso...
متن کاملCombinatory Logic Synthesizer
We present Combinatory Logic Synthesizer (CL)S, a typebased tool to automatically compose larger systems from repositories of components. We overview its underlying theory, combinatory logic with intersection types, and exemplify its application to synthesis. We describe features and architecture of the tool and our plans for its ongoing and future development. Finally, we present some use case...
متن کاملUsing Inhabitation in Bounded Combinatory Logic with Intersection Types for Composition Synthesis
We describe ongoing work on a framework for automatic composition synthesis from a repository of software components. This work is based on combinatory logic with intersection types. The idea is that components are modeled as typed combinators, and an algorithm for inhabitation — is there a combinatory term e with type τ relative to an environment Γ? — can be used to synthesize compositions. He...
متن کاملBounded Combinatory Logic
In combinatory logic one usually assumes a fixed set of basic combinators (axiom schemes), usually K and S. In this setting the set of provable formulas (inhabited types) is Pspacecomplete in simple types and undecidable in intersection types. When arbitrary sets of axiom schemes are considered, the inhabitation problem is undecidable even in simple types (this is known as Linial-Post theorem)....
متن کاملInductive Synthesis of Logic Programs by Composition of Combinatory Program Schemes
Based on a variable-free combinatory form of definite clause logic programs we outline a methodology and supporting program environment CombInduce for inducing well-moded logic programs from examples. The combinators comprise fold combinators for recursion on lists. The combinator form is distinguished by enabling piecewise composition of semantically meaningful program elements according to th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013